#ifndef __LIB_KERNEL_LIST_H
#define __LIB_KERNEL_LIST_H
#include "global.h"

#define offset(struct_type, member) (int)(&((struct_type*)0)->member)	//结构体成员member 在结构体中的偏移量,基址为0的一个member取地址为其在结构体中的偏移
#define elem2entry(struct_type, struct_member_name, elem_ptr) (struct_type*)((int)elem_ptr - offset(struct_type, struct_member_name))	

/**********   定义链表结点成员结构   *********** 
 * 结点中不需要数据成元，只要求前驱和后继结点指针
 */ 
struct list_elem {
	struct list_elem* prev;
	struct list_elem* next;	
};

/* 链表结构，用来实现队列 */
struct list {
/* head 是队首，是固定不变的，不是第1个元素，第1个元素为head.next */
	struct list_elem head;
	struct list_elem tail;
};

/* 自定义函数类型function，用于在list_traversal中做回调函数 */
typedef bool (function)(struct list_elem* , int arg);

void list_init(struct list*);
void list_insert_before(struct list_elem* before, struct list_elem* elem);
void list_push(struct list* plist, struct list_elem* elem);
void list_iterate(struct list* plist);
void list_append(struct list* plist, struct list_elem* elem);
void list_remove(struct list_elem* elem);
struct list_elem* list_pop(struct list* plist);
bool list_empty(struct list* plist);
uint32_t list_len(struct list* plist);
struct list_elem* list_traversal(struct list* plist, function func, int arg);
bool elem_find(struct list* plist, struct list_elem* obj_elem);

#endif